Split allocation model of intersection group oriented to network carrying capacity limit
نویسندگان
چکیده
منابع مشابه
Carrying Capacity in Barabási-Albert Network
The effect of finiteness in degree number is analyzed on a growing network. The dynamics is governed by a rule where the degree number increases under a scheme similar to the Malthus-Verhulst model in the context of population growth. One notices that the second moment of degree is closely related to the linking probability of this growing network. The degree distribution is analyzed in both st...
متن کاملAn efficient approach to enhance capacity allocation over Bluetooth network
With the current development of mobile devices, short range wireless communications have become more and more popular, and research on short range wireless communications, such as Bluetooth, has gained increasing interest, in industry as well as in academy. This paper analyzes capacity allocation issues in Bluetooth network as convex optimization problem. We formulate the problem of maximizing ...
متن کاملNetwork Capacity Allocation in Service Overlay Networks
We study the capacity allocation problem in service overlay networks (SON)s with state-dependent connection routing based on revenue maximization. We formulate the dimensioning problem as one in profit maximization and propose a novel model with several new features. In particular the proposed methodology employs an efficient approximation for state dependent routing that reduces the cardinalit...
متن کاملAspect Oriented UML to ECORE Model Transformation
With the emerging concept of model transformation, information can be extracted from one or more source models to produce the target models. The conversion of these models can be done automatically with specific transformation languages. This conversion requires mapping between both models with the help of dynamic hash tables. Hash tables store reference links between the elements of the source...
متن کاملSplit Closure and Intersection Cuts
In the seventies, Balas introduced intersection cuts for a Mixed Integer Linear Program (MILP), and showed that these cuts can be obtained by a closed form formula from a basis of the standard linear programming relaxation. In the early nineties, Cook, Kannan and Schrijver introduced the split closure of an MILP, and showed that the split closure is a polyhedron. In this paper, we show that the...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: MATEC Web of Conferences
سال: 2020
ISSN: 2261-236X
DOI: 10.1051/matecconf/202030805004